#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<LL,LL>map1;
LL vis[maxn];
LL a[maxn],b[maxn],c[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   for(LL i=1;i<=n;i++) cin>>a[i];
   for(LL i=1;i<=n;i++) cin>>b[i];
   for(LL i=1;i<=n;i++) cin>>c[i];
   for(LL i=1;i<=n;i++){
       vis[c[i]]++;
   }
   for(LL i=1;i<=n;i++){
       if(vis[i]){
          map1[b[i]]+=vis[i];
       }
   }
   LL ans=0;
   for(LL i=1;i<=n;i++){
       ans+=map1[a[i]];
   }
   cout<<ans<<"\n";
   return 0;
}
